On the density of integral sets with missing differences from sets related to arithmetic progressions
نویسندگان
چکیده
Article history: Received 23 February 2010 Revised 12 August 2010 Accepted 18 September 2010 Available online xxxx Communicated by Matthias Beck
منابع مشابه
Arithmetic Structures in Random Sets
We extend two well-known results in additive number theory, Sárközy’s theorem on square differences in dense sets and a theorem of Green on long arithmetic progressions in sumsets, to subsets of random sets of asymptotic density 0. Our proofs rely on a restriction-type Fourier analytic argument of Green and Green-Tao.
متن کاملCS 880 : Advanced Complexity Theory 3 / 31 / 2008 Lecture 24 : Additive Combinatorics
A random A yields A+A of size closer to the high end of |A|2. Furthermore, any set A whose members are sufficiently separated has |A+A| close to this high end, and the high end is actually tight for sets A that are geometric progressions, e.g. the first n powers of two. What about the low end of |A|: what is the structure of sets A where |A+A| is close to |A|? We can see that this low-end estim...
متن کاملThe structure of critical sets for Fp arithmetic progressions
If f were an indicator function for some set S ⊆ Fp, this would give a normalized count of the number of three-term progressions in S. In the present paper we establish a new structure theorem for functions f : Fp → [0, 1] that minimize the number of three-term progressions, subject to a density constraint; and, as a consequence of this result, we prove a further structural result, which can al...
متن کاملFurstenberg’s proof of long arithmetic progressions: Introduction to Roth’s Theorem
These are the notes for the first of a pair of lectures that will outline a proof given by Hillel Furstenberg [3] for the existence of long arithmetic progressions in sets of integers with positive upper density, a result first proved by Szemerédi [8]. 1 History of long arithmetic progressions The first major result in the theory of long arithmetic progressions was due to van der Waerden in 192...
متن کاملNew Bounds on Cap Sets
The problem of the maximal size of cap sets is a characteristic 3 model for the problem of finding arithmetic progressions of length 3 in rather dense sets of integers. Meshulam [M95] , through a direct use of ideas of Roth, was able to show that there is a constant C so that any cap set A has density at most C N . Our result may be viewed as a very modest improvement over Meshulam’s result. Sa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011